Symbolic Decision Procedures for QBF
نویسندگان
چکیده
Much recent work has gone into adapting techniques that were originally developed for SAT solving to QBF solving. In particular, QBF solvers are often based on SAT solvers. Most competitive QBF solvers are search-based. In this work we explore an alternative approach to QBF solving, based on symbolic quantifier elimination. We extend some recent symbolic approaches for SAT solving to symbolic QBF solving, using various decision-diagram formalisms such as OBDDs and ZDDs. In both approaches, QBF formulas are solved by eliminating all their quantifiers. Our first solver, QMRES, maintains a set of clauses represented by a ZDD and eliminates quantifiers via multi-resolution. Our second solver, QBDD, maintains a set of OBDDs, and eliminate quantifier by applying them to the underlying OBDDs. We compare our symbolic solvers to several competitive search-based solvers. We show that QBDD is not competitive, but QMRES compares favorably with search-based solvers on various benchmarks consisting of non-random formulas.
منابع مشابه
Model Checking with Quantified Boolean Formulas
Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to ...
متن کاملCompressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and then use QBF decision procedures to solve them. We discuss alternative encodings for unbounded and bounded safety checking into SAT and QBF. One contribution is a linear encoding of simple path constraints, which usually...
متن کاملsKizzo a QBF decision procedure based on Propositional Skolemization and Symbolic Reasoning
We introduce a novel algorithm for the evaluation of quantified boolean formulas (QBFs), which we call sKizzo. Our work is firstly framed in the broad field of algorithms for automated deduction. Then, we enlighten the strong application-related interest in decision procedures for QBFs. The algorithm itself is thoroughly discussed. It integrates within a uniform framework several different idea...
متن کاملA Symbolic Search Based Approach for Quantified Boolean Formulas
Solving Quantified Boolean Formulas (QBF) has become an important and attractive research area, since several problem classes might be formulated efficiently as QBF instances (e.g. planning, non monotonic reasoning, twoplayer games, model checking, etc). Many QBF solvers has been proposed, most of them perform decision tree search using the DPLL-like techniques. To set free the variable orderin...
متن کاملExtracting and Validating Skolem/Herbrand Function-Based QBF Certificates
Quantified Boolean Formulas (QBF) allow succinct representations of many real-world problems, e.g., in formal verification, artificial intelligence, or computer-aided design of integrated circuits. Hence, for many practical instances of QBF efficient decision procedures are highly requested. However, in many applications of QBF, it is not sufficient to ”just” solve problems but necessary to pro...
متن کامل